The optimum route problem by genetic algorithm for loading/unloading of yard crane

نویسندگان

  • Youfang Huang
  • Chengji Liang
  • Yang Yang
چکیده

In recent years, the scale of container transportation and the size of vessels are becoming larger and larger; development of automatic container cranes becomes a necessity. As a key function of automatic control of unmanned cranes, the optimum route can minimize the cycle time by calculating the most efficient combination of horizontal and vertical motions of container loading/unloading. In this study, we have comprehensively studied various issues in the route planning in different fields. Later, the mathematical model based on the problem analysis of loading/unloading process was presented. Particularly, to solve the problem, an optimum route method based on genetic algorithm, which satisfies the criteria such as length, smooth degree and safety distance, was developed. Finally, the computational experiments testified the effectiveness of the algorithm and explored a new way to increase the efficiency of container loading/unloading process. 2009 Published by Elsevier Ltd.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yard crane scheduling in port container terminals using genetic algorithm

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...

متن کامل

Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

متن کامل

A new approach for constraining failure probability of a critical deteriorating system Yard crane scheduling in port container terminals using genetic algorithm

In this paper, we focus on a continuously deteriorating critical equipment which its failure cannot be measured by cost criterion. For these types of systems like military systems, nuclear systems, etc it is extremely important to avoid failure during the actual operation of the system. In this paper we propose an approach which constrains failure probability to a pre-specified value. This valu...

متن کامل

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

متن کامل

Comparison of AHP and FAHP for Selecting Yard Gantry Cranes in Marine Container Terminals

The time that containerships or transportation trucks spend in marine container terminals for loading and unloading their cargo is a real cost scenario which affects, not only the smooth operation of ports, but also affect the overall cost of container trade. The operators of shipping lines and container terminals are required to realize the importance of this issue and the costs associated wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Industrial Engineering

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2009